Pseudonym Generation Scheme for Ad-Hoc Group Communication Based on IDH

نویسندگان

  • Mark Manulis
  • Jörg Schwenk
چکیده

In this paper we describe the advantages of using iterative Diffie-Hellman (IDH) key trees for mobile ad-hoc group communication. We focus on the Treebased Group Diffie-Hellman (TGDH) protocol suite, that consists of group key agreement protocols based on IDH key trees. Furthermore, we consider the anonymity of members during group communication over a public broadcast channel that provides untraceability of messages. The main goal of the proposed pseudonym generation scheme is to allow group members to generate their own pseudonyms that can be linked to their real identities only by a democratic decision of some interacting group members. The real identities are bound to public keys used in the group key agreement. The communication and computation costs as well as the security of the scheme can be optimized with respect to the characteristics of involved mobile devices.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pseudonym-based cryptography for anonymous communications in mobile ad hoc networks

Key management for anonymous communication in mobile ad hoc networks is a critical but unsolved problem. Many current anonymous mobile ad hoc routing protocols assume that mobile users share pairwise secrets before they start an anonymous communication session. This assumption is impractical for many ad hoc scenarios where pairwise shared keys are difficult to be set up in advance. Public-key b...

متن کامل

PUCA: A pseudonym scheme with strong privacy guarantees for vehicular ad-hoc networks

Pseudonym certificates are the state-of-the-art approach for secure and privacy-friendly message authentication in vehicular ad-hoc networks. However, most of the proposed pseudonym schemes focus on privacy among participants. Privacy towards backend providers is usually (if at all) only protected by separation of responsibilities. The protection can be overridden, when the entities collaborate...

متن کامل

Coalition Formation for Pseudonym Sharing Using Gale-shapley Algorithm in Vehicular Ad Hoc

The primary goal of VANET is to provide road safety measures where information about vehicle’s current speed, location coordinates passed with or without the development of infrastructure. This paper proposes an enhancement scheme of Pseudonym management with better privacy scheme. The pseudonym design focus on privacy among network participants. The major limitation of these vehicular ad hoc n...

متن کامل

Protocol Change Pseudonyms (PCP) for VANETs

Vehicle Ad-Hoc Network (VANET) is an advance wireless technology in the field of wireless communication, communicate for safety and comfort purpose. Many types of technology and application are being developed for VANET. The security protocols based on periodic change pseudonyms. The illegal traceability of vehicles during their communications avoid the idea and approach is the central authorit...

متن کامل

Cooperative pseudonym change scheme based on the number of neighbors in VANETs

In Vehicular Ad hoc NETworks (VANETs), trigger-based pseudonym change schemes play an important role in providing anonymity. However, the anonymity provided by these schemes usually is low mainly because the behavior of changing pseudonym is individual. Considering cooperation on changing pseudonym can enhance anonymity, in this paper, we give a general cooperation framework. As an application ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004